Quantum Goppa Codes over Hyperelliptic Curves

نویسنده

  • Annika Niehage
چکیده

This thesis provides an explicit construction of a quantum Goppa code for any hyperelliptic curve over a non-binary field. Hyperelliptic curves have conjugate pairs of rational places. We use these pairs to construct self-orthogonal classical Goppa codes with respect to a weighted inner product. These codes are also self-orthogonal with respect to a symplectic inner product and therefore define quantum stabilizer codes. A final transformation leads to a quantum Goppa code with respect to the standard symplectic inner product. Some examples illustrate the described construction. Furthermore we present a projection of a higher dimensional code onto the base field and a special case when the projected code is again weighted self-orthogonal and symmetric.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

Algebraic-Geometry Codes - Information Theory, IEEE Transactions on

The theory of error-correcting codes derived from curves in an algebraic geometry was initiated by the work of Goppa as generalizations of Bose-Chaudhuri-Hocquenghem (BCH), Reed–Solomon (RS), and Goppa codes. The development of the theory has received intense consideration since that time and the purpose of the paper is to review this work. Elements of the theory of algebraic curves, at a level...

متن کامل

Long Quadratic Residue Codes

A long standing problem has been to develop “good” binary linear block codes, C, to be used for error-correction. The length of the block is denoted n and the dimension of the code is denoted k. So in this notation C ⊆ GF (2) is a k-dimensional subspace. Another important parameter is the smallest weight of any non-zero codeword, d. This is related to error-correction because C can correct [d−1...

متن کامل

Nonbinary quantum error-correcting codes from algebraic curves

We give a generalized CSS construction for nonbinary quantum error-correcting codes. Using this we construct nonbinary quantum stabilizer codes from algebraic curves. We also give asymptotically good nonbinary quantum codes from a GarciaStichtenoth tower of function fields which are constructible in polynomial time. keywords Algebraic geometric codes, nonbinary quantum codes.

متن کامل

Goppa’s conjecture and counting points on hyperelliptic curves

A long standing problem has been to develop “good” binary linear codes to be used for error-correction. We show in this paper that the Goppa conjecture regarding “good” binary codes is incompatible with a conjecture on the number of points of hyperelliptic curves over finite fields of odd prime order. This rest of this introduction is devoted to explaining the precise result. Let C denote a bin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004